Search | Engineering

订阅投稿

首页工程期刊工程焦点工程成就工程前沿关于我们 English

资源类型

期刊论文 562

会议视频 8

年份

2023 48

2022 54

2021 40

2020 42

2019 44

2018 39

2017 39

2016 25

2015 25

2014 27

2013 23

2012 29

2011 10

2010 19

2009 11

2008 19

2007 19

2006 7

2005 9

2004 12

展开︾

关键词

优化 18

多目标优化 9

优化设计 8

遗传算法 6

稳健设计 4

不确定性 3

动态规划 3

智能制造 3

能源 3

一阶分析法 2

五品联动 2

仿真优化 2

分布式优化 2

参数率定 2

可视化仿真 2

可靠性 2

可靠性灵敏度 2

粒子群优化算法 2

非线性 2

展开︾

检索范围：

排序：展示方式：

Kd-tree and quad-tree decompositions for declustering of 2D range queries over uncertain space

Ahmet SAYAR,Süleyman EKEN,Okan ÖZTÜRK

《信息与电子工程前沿（英文）》 2015年第16卷第2期页码 98-108 doi: 10.1631/FITEE.1400165

摘要： We present a study to show the possibility of using two well-known space partitioning and indexing techniques, kd trees and quad trees, in declustering applications to increase input/output (I/O) parallelization and reduce spatial data processing times. This parallelization enables time-consuming computational geometry algorithms to be applied efficiently to big spatial data rendering and querying. The key challenge is how to balance the spatial processing load across a large number of worker nodes, given significant performance heterogeneity in nodes and processing skews in the workload.

关键词： Kd tree Quad tree Space partitioning Spatial indexing Range queries Query optimization

HTML PDF 收藏

基于同类用户的个性化查询词自动推荐方法 Regular Papers-Research Articles

Dan-yang JIANG, Hong-hui CHEN

《信息与电子工程前沿（英文）》 2019年第20卷第9期页码 1246-1258 doi: 10.1631/FITEE.1800010

摘要：查询词自动推荐（query auto-completion，QAC）通过预测查询词前缀对应的完整补全查询词帮助用户构造查询词。大多互联网搜索引擎利用用户的行为信息为用户提供个性化的查询词自动推荐列表。

关键词：查询词自动推荐；基于同类用户的信息检索；主题模型

HTML PDF 收藏

面向语义的精简化多关系频繁模式发现方法

杨炳儒,张伟,钱榕

《中国工程科学》 2008年第10卷第9期页码 47-53

摘要：

多关系频繁模式发现能够直接从复杂结构化数据中发现涉及多个关系的复杂频繁模式，避免了传统方法的局限。有别于主流基于归纳逻辑程序设计技术的方法，提出了基于合取查询包含关系的面向语义的精简化多关系频繁模式发现方法，具有理论与技术基础的新颖性，解决了两种语义冗余问题。实验表明，该方法在可理解性、功能、效率以及可扩展性方面具有优势。

关键词：多关系数据挖掘频繁模式发现合取查询精简化模式

HTML PDF 收藏

基于分布式表示语义组合的查询子主题挖掘 None

Wei SONG, Ying LIU, Li-zhen LIU, Han-shi WANG

《信息与电子工程前沿（英文）》 2018年第19卷第11期页码 1409-1419 doi: 10.1631/FITEE.1601476

摘要：推断查询意图对于信息检索具有重要意义。查询子主题挖掘旨在找到可能的子主题，用于表示给定查询的潜在意图。由于查询较短，子主题挖掘具有挑战性。学习词或句子分布式表示推动和影响了很多领域的发展。然而，没有清晰的结论表明该分布式表示是否有助于应对查询子主题挖掘面临的挑战。提出并比较利用分布式表示的语义组合进行查询子主题挖掘。采用两种分布式表示策略：能学习任意长度文本分布式表示的段落向量（paragraph vector）以及词向量的语义组合。探索了语义组合策略和数据类型对查询表示的影响。在国家信息学研究所信息获取研究试验平台和社区（National Institute of Informatics Testbeds and Community for Information Access Research，NTCIR）提供的公开数据集上的实验结果表明，与传统语义表示相比，分布式语义表示能获得更优查询子主题挖掘性能。文中做了更多深入探讨。

关键词：查询子主题挖掘；查询意图；分布式表示；语义组合

HTML PDF 收藏

基于机器学习的抄袭源检索的查询生成方法 Article

Lei-lei KONG, Zhi-mao LU, Hao-liang QI, Zhong-yuan HAN

《信息与电子工程前沿（英文）》 2017年第18卷第10期页码 1556-1572 doi: 10.1631/FITEE.1601344

摘要：抄袭源检索是抄袭检测的核心任务。使用从可疑文档提取的查询来检索抄袭源已成为抄袭源检索的标准方法。从可疑文档生成查询是源检索最重要的步骤。当前研究主要使用了基于启发式的查询生成方法。然而，每个启发式方法都有其优点，不同方法生成的查询可以获得不同的源检索结果，没有一种方法生成的查询的源检索性能可以在所有的文本片段上具有统计有效性地优于其他方法。这使得基于启发式的源检索查询生成方法的性能改善主要依赖专家经验。因此，很难开发一种可以克服现有启发式方法的新方法。本文提出使用统计机器学习方法解决源检索的查询生成问题，将源检索的查询生成形式化到一个排序学习的框架下，从备选查询中选择有利于提高源检索性能的查询，力争在每个可疑文档片段上获得最优的源检索性能。据我们所知，这是第一项应用机器学习方法解决源检索查询生成问题的工作。为了解决排序学习训练用例的缺失，提出了基于现有源检索语料构建查询生成语料的方法。在PAN抄袭源检索评测数据上的试验结果证明了该方法具有统计意义地优于多个基线方法。

关键词：抄袭检测；源检索；查询生成；机器学习；排序学习

HTML PDF 收藏

基于最大重要度优先查询的动态剪枝算法

Kun JIANG,Yue-xiang YANG

《信息与电子工程前沿（英文）》 2016年第17卷第1期页码 1-14 doi: 10.1631/FITEE.1500190

摘要：

已经研究了反向索引遍历技术来解决Web搜索引擎的查询处理性能挑战，但是仍然有很多改进的余地。在本文中，我们将重点放在文档排序索引的倒排索引遍历和称为动态修剪的优化技术上，该技术可以有效地减少所需的硬件计算资源。我们提出了另一种新颖的穷举索引遍历方案，称为最大分数优先（LSF）检索，其中首先在具有最大上限分数的重要查询词的发布列表中选择候选者，然后对其余查询词的贡献进行全面评分。该方案可以有效地减少现有的一次性词汇（TAAT）的内存消耗和现有的一次性文档（DAAT）检索的候选选择成本，但以重新访问其余查询词语的发布列表为代价。初步分析和实施表明，LSF和两个众所周知的基准之间的性能相当。为了进一步减少需要重新审查的发布数量，我们提出了基于LSF的有效的排名安全动态修剪技术，包括两个重要的优化方法，分别称为列表省略（LSF_LO）和部分计分（LSF_PS），它们充分利用了查询字词的重要性。最终，TREC GOV2集合的实验结果表明，我们的新索引遍历方法在WAND基线上将查询延迟减少了近27％，并且与MaxScore基线相比，产生了更好的结果，而返回的结果与详尽评估相同。 >

关键词：倒排索引；索引遍历；查询延迟；最大重要度优先查询；动态剪枝

HTML PDF 收藏

量子密码协议研究现状与未来发展

张雪,高飞,秦素娟,张平

《中国工程科学》 2022年第24卷第4期页码 145-155 doi: 10.15302/J-SSCAE-2022.04.015

摘要： Quantum private query: A new kind of practical quantum cryptographic protocol [J].QKD-based quantum private query without a failure probability [J].Postprocessing of the oblivious key in quantum private query [J].Quantum wireless network private query with multiple third parties [J].Error tolerance bound in qkd-based quantum private query [J].

关键词：量子密码协议量子密钥分配量子数字签名量子保密查询

HTML PDF 收藏

Synergistic optimization framework for the process synthesis and design of biorefineries

《化学科学与工程前沿（英文）》 2022年第16卷第2期页码 251-273 doi: 10.1007/s11705-021-2071-9

摘要： The conceptual process design of novel bioprocesses in biorefinery setups is an important task, which remains yet challenging due to several limitations. We propose a novel framework incorporating superstructure optimization and simulation-based optimization synergistically. In this context, several approaches for superstructure optimization based on different surrogate models can be deployed. By means of a case study, the framework is introduced and validated, and the different superstructure optimization approaches are benchmarked. The results indicate that even though surrogate-based optimization approaches alleviate the underlying computational issues, there remains a potential issue regarding their validation. The development of appropriate surrogate models, comprising the selection of surrogate type, sampling type, and size for training and cross-validation sets, are essential factors. Regarding this aspect, satisfactory validation metrics do not ensure a successful outcome from its embedded use in an optimization problem. Furthermore, the framework’s synergistic effects by sequentially performing superstructure optimization to determine candidate process topologies and simulation-based optimization to consolidate the process design under uncertainty offer an alternative and promising approach. These findings invite for a critical assessment of surrogate-based optimization approaches and point out the necessity of benchmarking to ensure consistency and quality of optimized solutions.

关键词： biotechnology surrogate modelling superstructure optimization simulation-based optimization process design

HTML PDF 收藏

Recent advances in system reliability optimization driven by importance measures

Shubin SI, Jiangbin ZHAO, Zhiqiang CAI, Hongyan DUI

《工程管理前沿（英文）》 2020年第7卷第3期页码 335-358 doi: 10.1007/s42524-020-0112-6

摘要： System reliability optimization problems have been widely discussed to maximize system reliability with resource constraints. Birnbaum importance is a well-known method for evaluating the effect of component reliability on system reliability. Many importance measures (IMs) are extended for binary, multistate, and continuous systems from different aspects based on the Birnbaum importance. Recently, these IMs have been applied in allocating limited resources to the component to maximize system performance. Therefore, the significance of Birnbaum importance is illustrated from the perspective of probability principle and gradient geometrical sense. Furthermore, the equations of various extended IMs are provided subsequently. The rules for simple optimization problems are summarized to enhance system reliability by using ranking or heuristic methods based on IMs. The importance-based optimization algorithms for complex or large-scale systems are generalized to obtain remarkable solutions by using IM-based local search or simplification methods. Furthermore, a general framework driven by IM is developed to solve optimization problems. Finally, some challenges in system reliability optimization that need to be solved in the future are presented.

关键词： importance measure system performance reliability optimization optimization rules optimization algorithms

HTML PDF 收藏

Split-order consolidation optimization for online supermarkets: Process analysis and optimization models

《工程管理前沿（英文）》页码 499-516 doi: 10.1007/s42524-022-0221-5

摘要： The large-scale online supermarket is a newly emerging online retailing mode which brings great convenience to people. Online supermarkets are characterized by having large amounts of daily orders with potentially multiple items, diverse delivery times, and a high order-split rate. Multiple shipments for one order caused by order splitting result in high cost and disturbance and a large number of discarded consumable packages at online retailers and customers, causing severe damage to the environment. Accordingly, research on split-order consolidation fulfilment is critical for the advancement of the practice and theory in the context of highly complex online retailing. This paper first analyzes the characteristics and the challenges associated with the split-order consolidation problem that online supermarket is confronting and summarizes the new operational process of split-order consolidation fulfilment. Then, a time–space network optimization model is built, and its corresponding solution algorithm is presented to solve the questions of where and when to consolidate the split orders. Finally, the computation results of the numerical experiments are provided to verify the effectiveness of the algorithm, and a sensitivity analysis of the relevant parameters is performed. This work highlights the effect of order consolidation processes and fulfilment methods on the order fulfilment decision-making for online supermarkets. The purpose of this article is to help pave the way for more effective online supermarket management and order implementation.

关键词： online supermarkets split-order consolidation time–space network genetic algorithm

HTML PDF 收藏

Design and optimization of reactive distillation: a review

《化学科学与工程前沿（英文）》 2022年第16卷第6期页码 799-818 doi: 10.1007/s11705-021-2128-9

摘要： Reactive distillation process, a representative process intensification technology, has been widely applied in the chemical industry. However, due to the strong interaction between reaction and separation, the extension of reactive distillation technology is restricted by the difficulties in process analysis and design. To overcome this problem, the design and optimization of reactive distillation have been widely studied and illustrated for plenty of reactive mixtures over the past three decades. These design and optimization methods of the reactive distillation process are classified into three categories: graphical, optimization-based, and evolutionary/heuristic methods. The primary objective of this article is to provide an up-to-date review of the existing design and optimization methods. Desired and output information, advantages and limitations of each method are stated, the modification and development for original methodologies are also reviewed. Perspectives on future research on the design and optimization of reactive distillation method are proposed for further research.

关键词： reactive distillation process intensification design method reactive phase diagram optimization algorithm

HTML PDF 收藏

Review on the design and optimization of hydrogen liquefaction processes

Liang YIN, Yonglin JU

《能源前沿（英文）》 2020年第14卷第3期页码 530-544 doi: 10.1007/s11708-019-0657-4

摘要： The key technologies of liquefied hydrogen have been developing rapidly due to its prospective energy exchange effectiveness, zero emissions, and long distance and economic transportation. However, hydrogen liquefaction is one of the most energy-intensive industrial processes. A small reduction in energy consumption and an improvement in efficiency may decrease the operating cost of the entire process. In this paper, the detailed progress of design and optimization for hydrogen liquefaction in recent years are summarized. Then, based on the refrigeration cycles, the hydrogen liquefaction processes are divided into two parts, namely precooled liquefaction process and cascade liquefaction process. Among the existing technologies, the SEC of most hydrogen liquefaction processes is limited in the range of 5–8 (LH : liquid hydrogen). The exergy efficiencies of processes are around 40% to 60%. Finally, several future improvements for hydrogen liquefaction process design and optimization are proposed. The mixed refrigerants (MRs) as the working fluids of the process and the combination of the traditional hydrogen liquefaction process with the renewable energy technology will be the great prospects for development in near future.

关键词： hydrogen liquefaction energy consumption efficiency optimization

HTML PDF 收藏

Comparative seismic design optimization of spatial steel dome structures through three recent metaheuristic

《结构与土木工程前沿（英文）》 2022年第16卷第1期页码 57-74 doi: 10.1007/s11709-021-0784-y

摘要： Steel dome structures, with their striking structural forms, take a place among the impressive and aesthetic load bearing systems featuring large internal spaces without internal columns. In this paper, the seismic design optimization of spatial steel dome structures is achieved through three recent metaheuristic algorithms that are water strider (WS), grey wolf (GW), and brain storm optimization (BSO). The structural elements of the domes are treated as design variables collected in member groups. The structural stress and stability limitations are enforced by ASD-AISC provisions. Also, the displacement restrictions are considered in design procedure. The metaheuristic algorithms are encoded in MATLAB interacting with SAP2000 for gathering structural reactions through open application programming interface (OAPI). The optimum spatial steel dome designs achieved by proposed WS, GW, and BSO algorithms are compared with respect to solution accuracy, convergence rates, and reliability, utilizing three real-size design examples for considering both the previously reported optimum design results obtained by classical metaheuristic algorithms and a gradient descent-based hyperband optimization (HBO) algorithm.

关键词： steel dome optimization water strider algorithm grey wolf algorithm brain storm optimization algorithm hyperband optimization algorithm

HTML PDF 收藏

Optimization of multi-objective integrated process planning and scheduling problem using a priority basedoptimization algorithm

Muhammad Farhan AUSAF,Liang GAO,Xinyu LI

《机械工程前沿（英文）》 2015年第10卷第4期页码 392-404 doi: 10.1007/s11465-015-0353-y

摘要：

For increasing the overall performance of modern manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling (IPPS) problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS (MOIPPS) problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatching rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.

关键词： integrated process planning and scheduling (IPPS) dispatching rules priority based optimization algorithm multi-objective optimization

HTML PDF 收藏

Footholds optimization for legged robots walking on complex terrain

《机械工程前沿（英文）》 2023年第18卷第2期 doi: 10.1007/s11465-022-0742-y

摘要： This paper proposes a novel continuous footholds optimization method for legged robots to expand their walking ability on complex terrains. The algorithm can efficiently run onboard and online by using terrain perception information to protect the robot against slipping or tripping on the edge of obstacles, and to improve its stability and safety when walking on complex terrain. By relying on the depth camera installed on the robot and obtaining the terrain heightmap, the algorithm converts the discrete grid heightmap into a continuous costmap. Then, it constructs an optimization function combined with the robot’s state information to select the next footholds and generate the motion trajectory to control the robot’s locomotion. Compared with most existing footholds selection algorithms that rely on discrete enumeration search, as far as we know, the proposed algorithm is the first to use a continuous optimization method. We successfully implemented the algorithm on a hexapod robot, and verified its feasibility in a walking experiment on a complex terrain.

关键词： footholds optimization legged robot complex terrain adapting hexapod robot locomotion control